Predictive Graph Mining

نویسندگان

  • Andreas Karwath
  • Luc De Raedt
چکیده

Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patterns and then use these as features to build predictive models. Rather than building these models in a two step indirect way, the SMIREP system introduced in this paper, derives predictive rule models from molecular data directly. SMIREP combines the SMILES and SMARTS representation languages that are popular in computational chemistry with the IREP rule-learning algorithm by Fürnkranz. Even though SMIREP is focused on SMILES, its principles are also applicable to graph mining problems in other domains. SMIREP is experimentally evaluated on two benchmark databases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Don't Be Afraid of Simpler Patterns

This paper investigates the trade-off between the expressiveness of the pattern language and the performance of the pattern miner in structured data mining. This trade-off is investigated in the context of correlated pattern mining, which is concerned with finding the k-best patterns according to a convex criterion, for the pattern languages of itemsets, multi-itemsets, sequences, trees and gra...

متن کامل

Mining Tree Patterns with Partially Injective Homomorphisms

One of the main differences between ILP and graph mining is that while pattern matching in ILP is mainly defined by homomorphism (subsumption), it is the subgraph isomorphism in graph mining. Using that subgraph isomorphisms are injective homomorphisms, we bridge the gap between the two pattern matching operators with partially injective homomorphisms, which are homomorphisms requiring the inje...

متن کامل

Personal Knowledge/Learning Graph

Educational data mining and learning analytics have to date largely focused on specific research questions that provide insight into granular interactions. These insights have been abstracted to include the development of predictive models, intelligent tutors, and adaptive learning. While there are several domains where holistic or systems models have provided additional explanatory power, work...

متن کامل

Graph Mining Methods for Predictive Toxicology

The graph structures of molecules can be a rich source of information about their biological activity or chemical reactivity – however, very efficient methods are required for analyzing them. Due to its complexity, any representation of a chemical database can only convey some characteristics of the whole graph corpus. Additionally, the interesting patterns emerge only from the whole set of gra...

متن کامل

CPM: A Graph Pattern Matching Kernel with Diffusion for Accurate Graph Classification

Graph data mining is an active research area. Graphs are general modeling tools to organize information from heterogenous sources and have been applied in many scientific, engineering, and business fields. With the fast accumulation of graph data, building highly accurate predictive models for graph data emerges as a new challenge that has not been fully explored in the data mining community. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004